Monotone linkage clustering and quasi-concave set functions
نویسندگان
چکیده
منابع مشابه
Monotone Linkage Clustering and Quasi-Convex Set Functions
Greedily seriating objects one by one is implicitly employed in many heuristic clustering procedures, which can be described in terms of a linkage function measuring entity-to-set dissimilarities. A well-known clustering technique, single linkage clustering, can be considered as an example of the seriation procedures (actually, based on the minimum spanning tree construction) leading to the glo...
متن کاملDuality between quasi-concave functions and monotone linkage functions
A function F defined on all subsets of a finite ground set E is quasiconcave if F (X∪Y ) ≥ min{F (X), F (Y )} for all X, Y ⊂ E. Quasi-concave functions arise in many fields of mathematics and computer science such as social choice, theory of graph, data mining, clustering and other fields. The maximization of quasi-concave function takes, in general, exponential time. However, if a quasi-concav...
متن کاملQuasi-convex Functions and Quasi-monotone Operators
The notions of a quasi-monotone operator and of a cyclically quasi-monotone operator are introduced, and relations between such operators and quasi-convex functions are established.
متن کاملQuasi-concave functions on antimatroids
In this paper we consider quasi-concave set functions defined on antimatroids. There are many equivalent axiomatizations of antimatroids, that may be separated into two categories: antimatroids defined as set systems and antimatroids defined as languages. An algorthmic characterization of antimatroids, that considers them as set systems, was given in [4]. This characterization is based on the i...
متن کاملQuasi-Concave Functions and Greedy Algorithms
Many combinatorial optimization problems can be formulated as: for a given set system over E (i.e., for a pair (E, ) where ⊆ 2E is a family of feasible subsets of finite set E), and for a given function F : →R, find an element of for which the value of the function F is minimum or maximum. In general, this optimization problem is NP-hard, but for some specific functions and set systems the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1997
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(97)00053-0